Maximum agreement and compatible supertrees
نویسندگان
چکیده
منابع مشابه
Maximum agreement and compatible supertrees
Given a collection of trees on leaves with identical leaf set, the MAST, resp. MCT, problem consists in finding a largest subset of the leaves such that all input trees restricted to this set are identical, resp. have a common refinement. For MAST, resp. MCT, on rooted trees, we give an algorithm, where and is the smallest number of leaves whose removal leads to the existence of an agreement su...
متن کاملFixed Parameter Polynomial Time Algorithms for Maximum Agreement and Compatible Supertrees
Consider a set of labels L and a set of trees T = {T , T , . . . , T } where each tree T (i) is distinctly leaf-labeled by some subset of L. One fundamental problem is to find the biggest tree (denoted as supertree) to represent T which minimizes the disagreements with the trees in T under certain criteria. This problem finds applications in phylogenetics, database, and data mining. In this pap...
متن کاملOptimal Agreement Supertrees
An agreement supertree of a collection of unrooted phylogenetic trees {T1, T2, . . . , Tk} with leaf sets L(T1), L(T2), . . . ,L(Tk) is an unrooted tree T with leaf set L(T1) ∪ · · · ∪ L(Tk) such that each tree Ti is an induced subtree of T . In some cases, there may be no possible agreement supertrees of a set of trees, in other cases there may be exponentially many. We present polynomial time...
متن کاملMaximum likelihood supertrees.
We analyze a maximum likelihood approach for combining phylogenetic trees into a larger "supertree." This is based on a simple exponential model of phylogenetic error, which ensures that ML supertrees have a simple combinatorial description (as a median tree, minimizing a weighted sum of distances to the input trees). We show that this approach to ML supertree reconstruction is statistically co...
متن کاملMaximum Likelihood Supertrees Maximum Likelihood Supertrees MIKE STEEL AND ALLEN RODRIGO Author’s Affiliations
We analyse a maximum-likelihood approach for combining phylogenetic trees into a larger ‘supertree’. This is based on a simple exponential model of phylogenetic error, which ensures that ML supertrees have a simple combinatorial description (as a median tree, minimising a weighted sum of distances to the input trees). We show that this approach to ML supertree reconstruction is statistically co...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Discrete Algorithms
سال: 2007
ISSN: 1570-8667
DOI: 10.1016/j.jda.2006.08.005